Ramsey properties of random discrete structures
نویسندگان
چکیده
We study thresholds for Ramsey properties of random discrete structures. In particular, we determine the threshold for Rado’s theorem for solutions of partition regular systems of equations in random subsets of the integers and we prove the 1-statement of the conjectured threshold for Ramsey’s theorem for random hypergraphs. Those results were conjectured by Rödl and Ruciński and similar results were obtained independently by Conlon and Gowers.
منابع مشابه
Ramsey classes with forbidden homomorphisms and a closure
Extending classical early Ramsey-type results, the structural Ramsey theory originated at the beginning of 70ies, see [11] for references. However the list of Ramsey classes, as the top of the line of Ramsey properties, was somewhat limited. This was also supported by result of Nešetřil [7] that made a connection between Ramsey classes and ultrahomogeneous structures showing particularly that t...
متن کاملRamsey and Universality Properties of Random Graphs
This thesis investigates the interplay between two branches of discrete mathematics: Ramsey theory and random graphs. The origins of Ramsey theory can already be found in the work of Hilbert from the early 20th century. However, it was a simple but profound result of Frank P. Ramsey from 1930 which marked the beginning of the new field in mathematics. Phrased in graph theory terms, Ramsey’s the...
متن کاملDISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کاملAlgorithmic Randomness and Ramsey Properties of Countable Homogeneous Structures
We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group S∞ of a countable set. In this paper we address this problem by investigating a link between the symmetries associated with Ramsey Fräıssé order classes and algorithmic randomness.
متن کاملRamsey Properties of Random k-Partite, k-Uniform Hypergraphs
We investigate the threshold probability for the property that every r-coloring of the edges of a random binomial k-uniform hypergraph G(k)(n, p) yields a monochromatic copy of some fixed hypergraph G. In this paper we solve the problem for arbitrary k ≥ 3 and k-partite, k-uniform hypergraphs G.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 37 شماره
صفحات -
تاریخ انتشار 2010